Clustering for Surface Reconstruction

نویسندگان

  • Francesco Isgrò
  • Francesca Odone
  • Waqar Saleem
  • Oliver Schall
چکیده

We consider applications of clustering techniques, Mean Shift and Self-Organizing Maps, to surface reconstruction (meshing) from scattered point data and review a novel kernel-based clustering method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Surface reconstruction of detect contours for medical image registration purpose

Although, most of the abnormal structures of human brain do not alter the shape of outer envelope of brain (surface), some abnormalities can deform the surface extensively. However, this may be a major problem in a surface-based registration technique, since two nearly identical surfaces are required for surface fitting process. A type of verification known as the circularity check for th...

متن کامل

Organ Surface Reconstruction using B-Splines and Hu Moments

The following article presents a combination of image processing and computer graphics methods which form an algorithm for 3D surface reconstruction of inner organs imaged using Computed Tomography. The presented method uses k-means clustering and Hu moments to filter desired contours from a large number detected in CT frames. Leastsquares B-spline fitting is used to approximate the filtered co...

متن کامل

Meshless surface reconstruction by kernel clustering

We discuss a meshless approach to the problem of reconstructing a surface in from a finite sampling. This approach is a direct adaptation of a kernel method for clustering points in Euclidean space. The reconstructed surface is the preimage of the boundary of the smallest enclosing ball of the sample points mapped into some feature space. We have implemented this approach and report on our expe...

متن کامل

Volume-Surface Trees

Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provide an axis-aligned subdivision of the 3D space embedding a scene or an object. However, the purely volume-based behavior of these schemes often leads to strongly imbalanced surface clustering. In this article, we intro...

متن کامل

Camera-Clustering for Multi-Resolution 3–D Surface Reconstruction

In this paper we propose a framework for piecewise mesh-based 3D reconstruction from a set of calibrated images. Most of the existing approaches consider all available images at once. However, this is not tractable with very large sets of cameras. Therefore, we use subsets of images and evolve parts of the surface corresponding to those images. Our main contribution is an approach to partition ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005